package com.vint.mi;


/**
 * 1. medium
 * 2. 数组3n+1个，只有一个是单独的，其它的是三个出现，求单独的这个
 */
public class Mi73 {
    private static String solution(String line){
    	String[] src =line.split(",");
    	int[] a = new int[src.length];
    	for(int i=0;i<a.length;i++)a[i] = Integer.parseInt(src[i]);
    	return String.valueOf(three(a));
    }
    public static int three(int[] a){
    	int le = a.length;
    	int ones = 0;
	    int twos = 0;
	    int threes = 0;
	    for( int i = 0; i< a.length;i++){
	    	ones = ones ^ a[i];
	    	twos = ones & a[i]; //全1为1
	    }
	    return 0;
    }

    public static void main(String[] args) {
        System.out.println(solution("19,9,35,74,22"));
    }
}
